A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page frames is increased to 4, then the number of page transfers _________

  1. Home
  2. Back

Question:
A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page frames is increased to 4, then the number of page transfers _________

1. decreases

2. increases

3.remains the same

4.None of the mentioned

Posted Date:-2022-03-28 09:01:04

More MCQS Questions and answers

  1. A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements. P : Increasing the number of page frames allocated to a process sometimes increases the page fault rate Q : Some programs do not exhibit locality of reference Which of the following is TRUE?
  2. Cancellation point is the point where ______
  3. If multiple threads are concurrently searching through a database and one thread returns the result then the remaining threads must be ____
  4. If no frames are free, _____ page transfer(s) is/are required.
  5. If the thread pool contains no available thread ______
  6. Signals that occur at the same time, are presented to the process _______
  7. Thread pools limit the number of threads that exist at any one point, hence _______
  8. When a process blocks the receipt of certain signals?
  9. When the target thread periodically checks if it should terminate and terminates itself in an orderly manner, it is called?
  10. A FIFO replacement algorithm associates with each page the _______
  11. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ________
  12. A process can never be sure that a signal it has sent ________
  13. A process is thrashing if _____
  14. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page frames is increased to 4, then the number of page transfers _________
  15. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is?
  16. Because of virtual memory, the memory can be shared among ______
  17. Cancelling a thread asynchronously ______
  18. Each connection arriving at multi threaded servers via network is generally ______
  19. Effective access time is directly proportional to ______
  20. In FIFO page replacement algorithm, when a page must be replaced _______
  21. In most cases, if a process is sent a signal while it is executing a system call _____
  22. In UNIX, the abort() function sends the ________ signal to the calling process, causing abnormal termination.
  23. In UNIX, the set of masked signals can be set or cleared using the ________ function.
  24. In UNIX, the ______________ system call is used to send a signal.
  25. Instead of starting a new thread for every task to execute concurrently, the task can be passed to a ____
  26. Signals are identified by _____
  27. Signals of a given type _______
  28. Swap space exists in ______
  29. The aim of creating page replacement algorithms is to ______
  30. The number of the threads in the pool can be decided on factors such as ______
  31. The pager concerns with the ______
  32. The three ways in which a process responds to a signal are _______
  33. The usefulness of signals as a general inter process communication mechanism is limited because _______
  34. The usual effect of abnormal termination of a program is _______
  35. The _______ maintains pending and blocked bit vectors in the context of each process.
  36. Thread pools are useful when _______
  37. Thread pools help in ________
  38. Users _______ that their processes are running on a paged system.
  39. What is the idea behind thread pools?
  40. What is the Optimal page – replacement algorithm?
  41. What is Thread cancellation?
  42. When a page is selected for replacement, and its modify bit is set _________
  43. When a program tries to access a page that is mapped in address space but not loaded in physical memory, then ______
  44. When a web page is loading, and the user presses a button on the browser to stop loading the page?
  45. When one thread immediately terminates the target thread, it is called _______
  46. Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced?
  47. Which of the following is not TRUE?
  48. Which of the following page replacement algorithms suffers from Belady’s Anomaly?
  49. Working set model for page replacement is based on the assumption of ____
  50. ____ is the concept in which a process is copied into the main memory from the secondary memory according to the requirement.
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!